Timestamp Ordering and Nested Transactions

نویسنده

  • Nancy Lynch
چکیده

Using the [LM] model for database concurrency control and recovery, we describe a general method for proving serial correctness of concurrency control algorithms which use timestamp ordering. This method is then used to prove serial correctness of Reed's [R] object history mechanism. Thesis Supervisor: Title: Nancy Lynch Professor of Computer Science, Massachusetts Institute of Technology

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Timestamp Ordering Approach for Co-existing Traditional and Cooperative Transaction Processing

In order to support both traditional short transaction and long cooperative transactions, we propose a novel timestamp ordering approach. With this timestamp ordering method, short transactions can be processed in the traditional way, as if there are no cooperative transactions, therefore not be blocked by long transactions; cooperative transactions will not be aborted when there is a conflict ...

متن کامل

TRANSACTION SYNCHRONISATION IN OBJECT BASESy

We propose a formal model of concurrency control in object bases. An object base is like a database except that information is represented in terms of \objects" that encapsulate both data and the procedures through which the data can be manipulated. The model generalises the classical model of database concurrency control: it allows for nested transactions (as opposed to at transactions) which ...

متن کامل

Concurrency control based on role concept

A Role-Based Access Control (RBAC) model is used to make a system secure. In addition to keeping systems secure, objects have to be consistent in the presence of multiple transactions. Traditional locking protocols and timestamp ordering schedulers are based on ‘first-comer-winner’ and ‘timestamp order’ principles to make multiple conflicting transactions serialisable, respectively. In this pap...

متن کامل

On Transaction Processing with Partial Validation and Timestamp Ordering in Mobile Broadcast Environments

Conventional concurrency control protocols are inapplicable in mobile broadcast environments due to a number of constraints of wireless communications. Previous studies are focused on efficient processing of read-only transactions at the mobile clients, neglecting update transactions. In this paper, we design a new protocol for processing both read-only and update mobile transactions. The proto...

متن کامل

Concurrency Control in Distributed Object-Oriented Database Systems

Simulating distributed database systems is inherently difficult, as there are many factors that may influence the results. This includes architectural options as well as workload and data distribution. In this paper we present the DBsim simulator and some simulation results. The DBsim simulator architecture is extendible, and it is easy to change parameters and configuration. The simulation res...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1987